منابع مشابه
Accelerated Linearized Bregman Method
In this paper, we propose and analyze an accelerated linearized Bregman (ALB) method for solving the basis pursuit and related sparse optimization problems. This accelerated algorithm is based on the fact that the linearized Bregman (LB) algorithm is equivalent to a gradient descent method applied to a certain dual formulation. We show that the LB method requires O(1/ε) iterations to obtain an ...
متن کاملAnalysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregman method has the exact regularization property; namely, it converges to an exact solution of the basis pursuit problem whenever its smooth parameter α is greater than a certain value. The analysis is based on showing ...
متن کاملLinearized Bregman for l1-regularized Logistic Regression
Sparse logistic regression is an important linear classifier in statistical learning, providing an attractive route for feature selection. A popular approach is based on minimizing an l1-regularization term with a regularization parameter λ that affects the solution sparsity. To determine an appropriate value for the regularization parameter, one can apply the grid search method or the Bayesian...
متن کاملLinearized Bregman iterations for compressed sensing
Finding a solution of a linear equation Au = f with various minimization properties arises from many applications. One of such applications is compressed sensing, where an efficient and robust-to-noise algorithm to find a minimal `1 norm solution is needed. This means that the algorithm should be tailored for large scale and completely dense matrices A, while Au and A u can be computed by fast ...
متن کاملAccelerated Bregman Method for Linearly Constrained ℓ1-ℓ2 Minimization
We consider the linearly constrained `1-`2 minimization and propose the accelerated Bregman method for solving this minimization problem. The proposed method is based on the extrapolation technique, which is used in accelerated proximal gradient methods studied by Nesterov, Nemirovski, and others, and the equivalence between the Bregman method and the augmented Lagrangian method. O( 1 k2 ) conv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2012
ISSN: 0885-7474,1573-7691
DOI: 10.1007/s10915-012-9592-9